TESTING FOR EQUALITY BETWEEN MAXIMUM MATCHING AND MINIMUM NODE COVERING.GAVRIL F.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 199-202; BIBL. 5 REF.Article

AN ALGORITHM FOR TESTING CHORDALITY OF GRAPHS.GAVRIL F.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 4; PP. 110-112; BIBL. 2 REF.Article

ALGORITHMS ON CIRCULAR-ARC GRAPHS.GAVRIL F.1974; NETWORKS; U.S.A.; DA. 1974; VOL. 4; NO 4; PP. 357-369; BIBL. 1 P.Article

ALGORITHMS ON CLIQUE SEPARABLE GRAPHS.GAVRIL F.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 19; NO 2; PP. 159-165; BIBL. 7 REF.Article

Maximum weight independent sets and cliques in intersection graphs of filamentsGAVRIL, F.Information processing letters. 2000, Vol 73, Num 5-6, pp 181-188, issn 0020-0190Article

An efficiently solvable graph partition problem to which many problems are reducibleGAVRIL, F.Information processing letters. 1993, Vol 45, Num 6, pp 285-290, issn 0020-0190Article

Algorithms for maximum k-colorings and k-coverings of transitive graphsGAVRIL, F.Networks (New York, NY). 1987, Vol 17, Num 4, pp 465-470, issn 0028-3045Article

EDGE DOMINATING SETS IN GRAPHSYANNAKAKIS M; GAVRIL F.1980; SIAM J. APPL. MATH.; ISSN 0036-1399; USA; DA. 1980; VOL. 38; NO 3; PP. 364-372; BIBL. 13 REF.Article

An algorithm for fraternal orientation of graphsURRUTIA, J; GAVRIL, F.Information processing letters. 1992, Vol 41, Num 5, pp 271-274, issn 0020-0190Article

Intersection graphs of k-acyclic families of subtrees and relational database query processingGAVRIL, F; SHMUELI, O.Information processing letters. 1998, Vol 66, Num 1, pp 1-6, issn 0020-0190Article

The maximum-k-colorable subgraph problem for chordal graphsYANNAKAKIS, M; GAVRIL, F.Information processing letters. 1987, Vol 24, Num 2, pp 133-137, issn 0020-0190Article

A synthesis of methods for simulating vulnerability of armored vehiclesGAVRIL, F.Naval research logistics. 1995, Vol 42, Num 2, pp 247-265, issn 0894-069XArticle